WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(4, 0)
  "L" :: ["A"(5, 0)] -(1)-> "A"(4, 1)
  "L" :: ["A"(4, 0)] -(0)-> "A"(4, 0)
  "L" :: ["A"(5, 0)] -(0)-> "A"(5, 0)
  "N" :: ["A"(4, 0) x "A"(5, 0)] -(4)-> "A"(4, 1)
  "N" :: ["A"(5, 0) x "A"(5, 0)] -(5)-> "A"(5, 0)
  "max" :: ["A"(4, 1)] -(0)-> "A"(5, 0)
  "s" :: ["A"(4, 0)] -(4)-> "A"(4, 0)
  "s" :: ["A"(5, 0)] -(5)-> "A"(5, 0)
  "s" :: ["A"(5, 0)] -(5)-> "A"(5, 11)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(0, 0)
  "L" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "N" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "max" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)


Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1, 0)
  "\"0\"_A" :: [] -(0)-> "A"(0, 1)
  "\"L\"_A" :: ["A"(1, 0)] -(0)-> "A"(1, 0)
  "\"L\"_A" :: ["A"(1, 0)] -(1)-> "A"(0, 1)
  "\"N\"_A" :: ["A"(1, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
  "\"N\"_A" :: ["A"(0, 0) x "A"(1, 0)] -(0)-> "A"(0, 1)
  "\"s\"_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "\"s\"_A" :: ["A"(0, 0)] -(0)-> "A"(0, 1)